A Genetic Algorithm For Facility Layout Design In Flexible Manufacturing Systems

نویسندگان

  • Maheswaran Rajasekharan
  • Brett A. Peters
  • Taho Yang
چکیده

The flexible manufacturing system (FMS) facility layout problem (FLP) involves the positioning of cells within a given area so as to minimize the material flow costs between cells. The FLP design includes specifying the spatial coordinates of each cell, the orientation of each cell in either a horizontal or vertical position, and the position of each cell’s pickup and dropoff points. The layout design problem is both tactically and strategically important since the layout plays a large role in determining the efficiency and flexibility of the system. The FMS layout problem differs from traditional layout problems in that there are additional constraints on a cell’s shape and orientation and the location of the pickup/ dropoff points must be determined. A mixed integer programming formulation for the FLP developed by Das (1993) is adapted and heuristically solved in this paper. Because of the NP-hard nature of the solution space, a genetic algorithm based decomposition strategy is proposed and computationally tested. A comparison of the computational results with the existing methods indicate that the heuristic is a viable alternative for efficiently and effectively generating layout designs for flexible manufacturing systems.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An improved approach to find and rank BCC-efficient DMUs in data envelopment analysis (DEA)

Recently, a mixed integer data envelopment analysis (DEA) model has been proposed to find the most BCC-efficient (or the best) decision making unit (DMU) by Toloo (2012). This paper shows that the model may be infeasible in some cases, and when the model is feasible, it may fail to identify the most efficient DMU, correctly. We develop an improved model to find the most BCC-efficient DMU that r...

متن کامل

Applying Genetic Algorithm to Dynamic Layout Problem

In today’s economy, manufacturing plants must be able to operate efficiently and respond quickly to changes in the product mix and demand.[1] Layout design has a significant impact on manufacturing efficiency. Initially, it was treated as a static decision but due to improvements in technology, it is possible to rearrange the manufacturing facilities in different scenarios. The Plant layout...

متن کامل

A Quaternion Firefly Algorithm to Solve a Multi-row Facility Layout Problem (RESEARCH NOTE)

In this paper, a quaternion firefly algorithm is utilized to solve a multi-row facility layout design problem with the objective of minimizing the total cost of transportation. A quaternion firefly algorithm takes the motion of the firefly as a quaternion one. Consequently, the solution space is explored more accurately and the answers are of higher quality. That is, the answers are considerabl...

متن کامل

Integrative Cell Formation and Layout Design in Cellular Manufacturing Systems

This paper proposes a new integrative view of manufacturing cell formation and both inter-cell and intra-cell layout problems. Cells formation and their popular bi-directional linear layout are determined simultaneously through a Dynamic Programming algorithm (with the objective of minimizing the inter-cell flow cost under a cell size constraint). This Dynamic Programming algorithm is implement...

متن کامل

A heuristic method for combined optimization of layout design and cluster configuration in continuous productions

Facility layout problems have been generally solved either hierarchically or integrated into other phases of plant design. In this paper, a hybrid method is introduced so that clustering and facilities layout can be simultaneously optimized. Each cluster is formed by a group of connected facilities and selection of the most appropriate cluster configuration is aimed. Since exact method by MIP i...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1996